An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
نویسندگان
چکیده
منابع مشابه
An Eecient Parallel Algorithm for Two Processors Precedence Constraint Scheduling
We present a new parallel algorithm for the two processors scheduling problem. The algorithm uses only O(n 3) processores and takes time O(log 2 n) time on a PRAM. In order to prove the above bounds we show how to compute in NC the lexicographically rst matching for a special kind of convex bipartite graphs.
متن کاملParallel Algorithms for Two Processors Precedence Constraint Scheduling
In the general form of multiprocessor precedence scheduling problems a set of n tasks to be executed on m processors is given. Each task requires exactly one unit of execution time and can run on any processor. A directed acyclic graph specifies the precedence constraints where an edge from task x to task y means task x must be completed before task y begins. A solution to the problem is a sche...
متن کاملLower Bounds on Precedence-Constrained Scheduling for Parallel Processors
We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with r...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملPrecedence Constraint Posting for Cyclic Scheduling Problems
Resource constrained cyclic scheduling problems consist in planning the execution over limited resources of a set of activities, to be indefinitely repeated. In such a context, the iteration period (i.e. the difference between the completion time of consecutive iterations) naturally replaces the makespan as a quality measure; exploiting inter-iteration overlapping is the primary method to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00120-7